Further Combinatorial Properties of Cohen Forcing
نویسنده
چکیده
The combinatorial properties of Cohen forcing imply the existence of a countably closed, א2-c.c. forcing notion P which adds a C(ω2)-name Q for a σ-centered poset such that forcing with Q over V P×C(ω2) adds a real not split by V C(ω2) ∩ [ω] and preserves that all subfamilies of size ω1 of the Cohen reals are unbounded.
منابع مشابه
Some Algebraic and Combinatorial Properties of the Complete $T$-Partite Graphs
In this paper, we characterize the shellable complete $t$-partite graphs. We also show for these types of graphs the concepts vertex decomposable, shellable and sequentially Cohen-Macaulay are equivalent. Furthermore, we give a combinatorial condition for the Cohen-Macaulay complete $t$-partite graphs.
متن کاملHow much sweetness is there in the universe?
We continue investigations of forcing notions with strong ccc properties introducing new methods of building sweet forcing notions. We also show that quotients of topologically sweet forcing notions over Cohen reals are topologically sweet while the quotients over random reals do not have to be such. One of the main ingredients of the construction of the model for all projective sets of reals h...
متن کاملFuzzy Forcing Set on Fuzzy Graphs
The investigation of impact of fuzzy sets on zero forcing set is the main aim of this paper. According to this, results lead us to a new concept which we introduce it as Fuzzy Zero Forcing Set (FZFS). We propose this concept and suggest a polynomial time algorithm to construct FZFS. Further more we compute the propagation time of FZFS on fuzzy graphs. This concept can be more efficient to model...
متن کاملMathias-Prikry and Laver-Prikry type forcing
We study the Mathias-Prikry and Laver-Prikry forcings associated with filters on ω. We give a combinatorial characterization of Martin’s number for these forcing notions and present a general scheme for analyzing preservation properties for them. In particular, we give a combinatorial characterization of those filters for which the Mathias-Prikry forcing does not add any dominating reals.
متن کاملA ug 2 00 9 LINEAR σ - ADDITIVITY AND SOME APPLICATIONS
We show that countable increasing unions preserve a large family of well-studied covering properties, which are not necessarily σ-additive. Using this, together with infinite-combinatorial methods and simple forcing theoretic methods, we explain several phenomena, settle problems of Just, Miller, Scheepers and Szeptycki [15], Gruenhage and Szeptycki [13], Tsaban and Zdomskyy [33], and Tsaban [2...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008